Two-Level Structural Sparsity Regularization for Identifying Lattices and Defects in Noisy Images
نویسندگان
چکیده
This paper presents a regularized regression model with a two-level structural sparsity penalty applied to locate individual atoms in a noisy scanning transmission electron microscopy image (STEM). In crystals, the locations of atoms is symmetric, condensed into a few lattice groups. Therefore, by identifying the underlying lattice in a given image, individual atoms can be accurately located. We propose to formulate the identification of the lattice groups as a sparse group selection problem. Furthermore, real atomic scale images contain defects and vacancies, so atomic identification based solely on a lattice group may result in false positives and false negatives. To minimize error, model includes an individual sparsity regularization in addition to the group sparsity for a within-group selection, which results in a regression model with a two-level sparsity regularization. We propose a modification of the group orthogonal matching pursuit (gOMP) algorithm with a thresholding step to solve the atom finding problem. The convergence and statistical analyses of the proposed algorithm are presented. The proposed algorithm is also evaluated through numerical experiments with simulated images. The applicability of the algorithm on determination of atom structures and identification of imaging distortions and atomic defects was demonstrated using three real STEM images. We believe this is an important step toward automatic phase identification and assignment with the advent of genomic databases for materials.
منابع مشابه
A Sharp Sufficient Condition for Sparsity Pattern Recovery
Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...
متن کامل3D Inversion of Magnetic Data through Wavelet based Regularization Method
This study deals with the 3D recovering of magnetic susceptibility model by incorporating the sparsity-based constraints in the inversion algorithm. For this purpose, the area under prospect was divided into a large number of rectangular prisms in a mesh with unknown susceptibilities. Tikhonov cost functions with two sparsity functions were used to recover the smooth parts as well as the sharp ...
متن کاملIntegrating Fuzzy Inference System, Image Processing and Quality Control to Detect Defects and Classify Quality Level of Copper Rods
Human-based quality control reduces the accuracy of this process. Also, the speed of decision making in some industries is very important. For removing these limitations in human-based quality control, in this paper, the design of an expert system for automatic and intelligent quality control is investigated. In fact, using an intelligent system, the accuracy in quality control is increased. It...
متن کاملOptimized co-registration method of Spinal cord MR Neuroimaging data analysis and application for generating multi-parameter maps
Introduction: The purpose of multimodal and co-registration In MR Neuroimaging is to fuse two or more sets images (T1, T2, fMRI, DTI, pMRI, …) for combining the different information into a composite correlated data set in order to visualization, re-alignment and generating transform to functional Matrix. Multimodal registration and motion correction in spinal cord MR Neuroimag...
متن کاملLocal sparsity enhanced compressed sensing magnetic resonance imaging in uniform discrete curvelet domain
BACKGROUND Compressed sensing(CS) has been well applied to speed up imaging by exploring image sparsity over predefined basis functions or learnt dictionary. Firstly, the sparse representation is generally obtained in a single transform domain by using wavelet-like methods, which cannot produce optimal sparsity considering sparsity, data adaptivity and computational complexity. Secondly, most s...
متن کامل